package LeetCode;

/**
 * @author VX5
 * @Title: MJC
 * @ProjectName interview
 * @Description: TODO
 * @date ${DAT}21:00
 */
public class LeetCode63 {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int[][] dp = new int[obstacleGrid.length][obstacleGrid[0].length];
        boolean refuse = false;
        for (int i = 0; i < dp.length; i++){
            if (!refuse){
                if (obstacleGrid[i][0] == 1){
                    refuse = true;
                    dp[i][0] = 0;
                }else {
                    dp[i][0] = 1;
                }
            }else {
                dp[i][0] = 0;
            }
        }
        refuse = false;

        for (int i = 0; i < dp[0].length; i++){
            if (!refuse){
                if (obstacleGrid[0][i] == 1){
                    refuse = true;
                    dp[0][i] = 0;
                }else {
                    dp[0][i] = 1;
                }
            }else {
                dp[0][i] = 0;
            }
        }

        for (int i = 1; i < dp.length; i++){
            for (int j = 1; j < dp[i].length; j++){
                if (obstacleGrid[i][j] == 1){
                    dp[i][j] = 0;
                }else {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
        }
        return dp[dp.length - 1][dp[0].length - 1];
    }

    public static void main(String[] args) {
        int[][] obstacleGrid = {
                {0,0,0,0},
                {0,1,0,0},
                {0,0,0,0}
        };
        System.out.println(new LeetCode63().uniquePathsWithObstacles(obstacleGrid));
    }
}
